Uses of Interface
edu.claflin.finder.algo.jungutils.Graph

Packages that use Graph

Package	Description
edu.claflin.finder.algo.jungutils

Uses of Graph in edu.claflin.finder.algo.jungutils

Subinterfaces of Graph in edu.claflin.finder.algo.jungutils

Modifier and Type	Interface	Description
interface	UndirectedGraph<V,E>	A tagging interface for extensions of Graph that accept only undirected edges.

Classes in edu.claflin.finder.algo.jungutils that implement Graph

Modifier and Type	Class	Description
class	AbstractGraph<V,E>	Abstract implementation of the Graph interface.
class	AbstractTypedGraph<V,E>	An abstract class for graphs whose edges all have the same EdgeType.
class	SparseGraph<V,E>	An implementation of Graph that is suitable for sparse graphs and permits both directed and undirected edges.
class	UndirectedSparseGraph<V,E>	An implementation of UndirectedGraph that is suitable for sparse graphs.

Fields in edu.claflin.finder.algo.jungutils declared as Graph

Modifier and Type	Field	Description
protected Graph<V,E>	BetweennessCentrality.graph

Methods in edu.claflin.finder.algo.jungutils with parameters of type Graph

Modifier and Type	Method	Description
java.util.Set<java.util.Set<V>>	EdgeBetweennessClusterer.apply(Graph<V,E> graph)	Finds the set of clusters which have the strongest "community structure".
java.util.Set<java.util.Set<V>>	WeakComponentClusterer.apply(Graph<V,E> graph)	Extracts the weak components from a graph.
protected void	BetweennessCentrality.initialize(Graph<V,E> graph)

Constructors in edu.claflin.finder.algo.jungutils with parameters of type Graph

Constructor	Description
BetweennessCentrality(Graph<V,E> graph)	Calculates betweenness scores based on the all-pairs unweighted shortest paths in the graph.
BetweennessCentrality(Graph<V,E> graph, Function<? super E,? extends java.lang.Number> edge_weights)	Calculates betweenness scores based on the all-pairs weighted shortest paths in the graph.